package com.zhangxiaofanfan.hotcode.third;

import java.util.Arrays;

/**
 * <a href="https://leetcode.cn/problems/longest-common-subsequence/description/?envType=study-plan-v2&envId=top-100-liked">1143. 最长公共子序列</a>
 *
 * @date 2024-07-13 03:14:13
 * @author zhangxiaofanfan
 */
public class HotCode094 {
    public static void main(String[] args) {
        HotCode094 hotCode = new HotCode094();
        System.out.println(hotCode.longestCommonSubsequence("abcde", "ace"));
    }

    public int longestCommonSubsequence(String text1, String text2) {
        return 0;
    }
}